Optimal scaling of average queue sizes in an input-queued switch: an open problem

نویسندگان

  • Devavrat Shah
  • John N. Tsitsiklis
  • Yuan Zhong
چکیده

We review some known results and state a few versions of an open problem related to the scaling of the total queue size (in steady state) in an n×n input-queued switch, as a function of the port number n and the load factor ρ. Loosely speaking, the question is whether the total number of packets in queue, under either the maximum weight policy or under an optimal policy, scales (ignoring any logarithmic factors) as O(n/(1 − ρ)).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Delay Analysis of Maximal Matching Switching with Speedup

In this paper we analyze the average queue lengths in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare these average queue lengths to the average queue lengths achieved by an optimal switch. We model the cell arrival process as independent and identically distributed between time slots and uniformly distributed among input and output ports. Fo...

متن کامل

On Queue-Size Scaling for Input-Queued Switches

We study the optimal scaling of the expected total queue size in an n×n input-queued switch, as a function of the number of ports n and the load factor ρ, which has been conjectured to be Θ(n/(1−ρ)) (cf. [15]). In a recent work [16], the validity of this conjecture has been established for the regime where 1 − ρ = O(1/n). In this paper, we make further progress in the direction of this conjectu...

متن کامل

A combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch

Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...

متن کامل

Practical Scheduling Algorithms for Input - Queued

| The input-queued (IQ) switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. In this paper, two new algorithms, referred to as maximum credit rst (MCF) algorithm and iterative maximum credit rst (IMCF) algorithm, are introduced. Theo-retic analysis shows that the credits of an IQ switch using MCF are bounded for all admissible rate reser...

متن کامل

Performance of Prioritized i-SLIP Algorithm with Multiple Input Queued Switch

Input Queued Switch has throughput limitation of 58%.Hence concept of Virtual Output Queue is evolved. Selection of ‘N’ cells out of N is difficult task. Prof.Nick Mckeown from Stanford University had suggested i-slip algorithm to provide throughput of 100%. Multiple Input Queued Switch is generalized case of Input Queued Switch, where M indicates number of queues/port. When M=N, its VOQ. When ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2011